Differential cryptanalysis on DES cryptosystem up to eight rounds

نویسندگان
چکیده

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Applying Diierential Cryptanalysis to Des Reduced to 5 Rounds

Diierential cryptanalysis is a powerful attack developed by Eli Biham and Adi Shamir. It has been successfully applied to many DES-like cryptosystems. We provide a brief introduction to their paper BS91] and show how to apply diierential cryptanalysis to attack the Data Encryption Standard (DES) reduced to 5 rounds.

متن کامل

Differential Fault Analysis on DES Middle Rounds

Differential Fault Analysis (DFA) is a powerful cryptanalytic technique that disturbs cryptographic computations and exploits erroneous results to infer secret keys. Over the last decade, many works have described and improved DFA techniques against block ciphers thus showing an inherent need to protect their implementations. A simple and widely used solution is to perform the computation twice...

متن کامل

Algebraic-Differential Cryptanalysis of DES

Algebraic cryptanalysis is as a general framework that permits to assess the security of a wide range of cryptographic schemes. However, the feasibility of algebraic cryptanalysis against block ciphers remains the source of speculation and especially in targeting modern block ciphers. The main problem is that the size of the corresponding algebraic system is so huge (thousand of variables and e...

متن کامل

On Resistance of DES to Related-Key Differential Cryptanalysis

The key schedule of the Data Encryption Standard is analyzed, and it is shown that the properties of the permuted choice PC-2 transformation and the number of bits that are left shifted during the key generation are critical for the security of the algorithm. More precisely, we were able to mount a low complexity related-key attack on DES with slightly modified key schedule although no related-...

متن کامل

Self-Differential Cryptanalysis of Up to 5 Rounds of SHA-3

On October 2-nd 2012 NIST announced its selection of the Keccak scheme as the new SHA-3 hash standard. In this paper we present the first published collision finding attacks on reduced-round versions of Keccak-384 and Keccak-512, providing actual collisions for 3-round versions, and describing attacks which are much faster than birthday attacks for 4-round Keccak-384. For Keccak-256, we increas...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: International Journal of Information Privacy, Security and Integrity

سال: 2019

ISSN: 1741-8496,1741-850X

DOI: 10.1504/ijipsi.2019.103560